RCP-AC: Congestion control to make flows

نویسندگان

  • Nandita Dukkipati
  • Nick McKeown
  • Alexander G. Fraser
چکیده

We believe that a congestion control algorithm should make flows finish quickly as quickly as possible, while staying stable and fair among flows. Recently, we proposed RCP (Rate Control Protocol) which enables typical Internet-sized flows to complete one to two orders of magnitude faster than the existing (TCP Reno) and the proposed (XCP) congestion control algorithm. Like XCP, RCP uses explicit feedback from routers, but doesn’t require per-packet calculations. A router maintains just one rate that it gives to all flows, making it simple and inherently fair. Flows finish quickly because RCP aggressively gives excess bandwidth to flows, making it work well in the common case. However and this is a design tradeoff RCP will experience short-term transient overflows when network conditions change quickly (e.g. a route change or flash crowds). In this paper we extend RCP and propose RCP-AC (Rate Control Protocol with Acceleration Control) that allows the aggressiveness of RCP to be tuned, enabling fast completion of flows over a broad set of operating conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NCP: Finishing Flows Even More Quickly

The transmission control protocol (TCP) is the major transport layer protocol in the Internet today. TCP and its variants have the drawback of not knowing the explicit rate share of flows at bottleneck links. The Rate Control Protocol (RCP) is a major clean slate congestion control protocol which has been recently proposed to address these drawbacks. RCP tries to get explicit knowledge of flow ...

متن کامل

On the Limitation of the Rate Control Protocol (RCP)

The rate control protocol (RCP) is a new network congestion control protocol which is designed to achieve smaller file completion times, fairness among flows competing for resources in the network and efficient use of available bandwidth. In this paper I show that the heuristic protocol, RCP performs well only for a specific scenario. I further derive an exact formula for a robust protocol whic...

متن کامل

A Network Congestion control Protocol (NCP)

The transmission control protocol (TCP) which is the dominant congestion control protocol at the transport layer is proved to have many performance problems with the growth of the Internet. TCP for instance results in throughput degradation for high bandwidth delay product networks and is unfair for flows with high round trip delays. There have been many patches and modifications to TCP all of ...

متن کامل

Why Flow-Completion Time is the Right metric for Congestion Control and why this means we need new algorithms

Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words, Flow Completion Time (FCT) is an important arguably the most important performance metric for the user. Yet research on congestion control focuses almost entirely on maximizing flow throughput, link utilization and ...

متن کامل

Processor Sharing Flows in the Internet

Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and prevents long flows from hogging resources. For example, if a set of flows with the same RTT share a bottleneck link, TCP’s congestion control mechanism tries to achieve PS; so do most of the proposed alternatives, such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006